Translation-Based Constraint Answer Set Solving
نویسندگان
چکیده
We solve constraint satisfaction problems through translation to answer set programming (ASP). Our reformulations have the property that unitpropagation in the ASP solver achieves well defined local consistency properties like arc, bound and range consistency. Experiments demonstrate the computational value of this approach.
منابع مشابه
Constraint Answer Set Programming Based on HEX-Programs
Constraint Answer Set Programming (CASP) is a convenient integration of the Answer Set Programming (ASP) paradigm with constraint programming (CP), which was exploited for a range of applications. HEX-programs are another extension of ASP towards integration of arbitrary external sources through socalled external atoms. In this work, we integrate HEX-programs with CP, which results in a strict ...
متن کاملConflict-Driven Disjunctive Answer Set Solving
We elaborate a uniform approach to computing answer sets of disjunctive logic programs based on state-of-theart Boolean constraint solving techniques. Starting from a constraint-based characterization of answer sets, we develop advanced solving algorithms, featuring backjumping and conflict-driven learning using the First-UIP scheme as well as sophisticated unfounded set checking. As a final re...
متن کاملSymmetry Breaking for Answer Set Programming
In the context of answer set programming, this work investigates symmetry detection and symmetry breaking to eliminate symmetric parts of the search space and, thereby, simplify the solution process. We contribute a reduction of symmetry detection to a graph automorphism problem which allows to extract symmetries of a logic program from the symmetries of the constructed coloured graph. The corr...
متن کاملConflict-Driven Constraint Answer Set Solving with Lazy Nogood Generation
We present a new approach to enhancing answer set programming (ASP) with constraint programming (CP) techniques based on conflict-driven learning and lazy nogood generation.
متن کاملOn relation between constraint answer set programming and satisfiability modulo theories
Constraint answer set programming is a promising research direction that integrates answer set programming with constraint processing. It is often informally related to the field of satisfiability modulo theories. Yet, the exact formal link is obscured as the terminology and concepts used in these two research areas differ. In this paper, we connect these two research areas by uncovering the pr...
متن کامل